Separating Words with Small Grammars
نویسندگان
چکیده
We study the following problem: given two words w and x, with jwj; jxj n, what is the size of the smallest context-free grammar G which generates exactly one of fw; xg? If jwj 6 = jxj, then we prove there exists a G separating w from x of size O(log log n), and this bound is best possible. If jwj = jxj, then we get an upper bound on the size of G of O(log n), and a lower bound of (logn loglog n).
منابع مشابه
Some Results on Small Context-free Grammars Generating Primitive Words
In this report we characterize all context-free grammars with not more than three nonterminals generating only primitive words. 1This work was supported by the German-Hungarian Research Project 102 of OMFB ( Hungarian Research Foundation ) and Project X 233.6 of Forschungszentrum Karlsruhe
متن کاملDevelopmental Constraints on Learning Artificial Grammars with Fixed, Flexible and Free Word Order
Human learning, although highly flexible and efficient, is constrained in ways that facilitate or impede the acquisition of certain systems of information. Some such constraints, active during infancy and childhood, have been proposed to account for the apparent ease with which typically developing children acquire language. In a series of experiments, we investigated the role of developmental ...
متن کاملRapid Adaptive Development of Semantic Analysis Grammars
In this paper we describe a process for rapid development of semantic analysis grammars for Interlingual Machine Translation. The technique applies to existing systems and can be used to extend coverage into new languages quickly by separating the informant tasks performed by native speakers from the grammar writing tasks performed by engineers familiar with the system. A tool for automatic man...
متن کاملContextual Grammars with Distributed Catenation and Shuffle
We introduce a new type of contextual grammars. Instead of considering the catenation operation we use the distributed catenation operation. The contexts are distributed catenated with words from the language, de ning in this way new words from the language. We investigate several properties of the languages generated by distributed catenated contextual grammars. Finally, we also present the re...
متن کاملBilexical Grammars and a Cubic-time Probabilistic Parser
Computational linguistics has a long tradition of lexicalized grammars, in which each grammatical rule is specialized for some individual word. The earliest lexicalized rules were word-specific subcategorization frames. It is now common to find fully lexicalized versions of many grammatical formalisms, such as context-free and tree-adjoining grammars [Schabes et al. 1988]. Other formalisms, suc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Automata, Languages and Combinatorics
دوره 4 شماره
صفحات -
تاریخ انتشار 1999